Search
Results: 2
Experimental Programming of Genetic Algorithms for the “Casse-Tête” Problem
Sarab Almuhaideb, Shahad Alohaydib, Dana Aldossari, Ghaida Alfarraj, Shahad Musaibeeh, Atheer Alrosayes, Afnan Abouelwafa
Jan 01, 2022
The Casse-tête board puzzle consists of an n×n grid covered with n^2 tokens. m<n^2 tokens are deleted from the grid so that each row and column of the grid contains an even number of remaining tokens. The size of the search...
Published by: IGI Global
Clique Finder
Sarab Almuhaideb, Najwa Altwaijry, Shahad AlMansour, Ashwaq AlMklafi, AlBandery AlMojel, Bushra AlQahtani, Moshail AlHarran
Apr 01, 2022
The Maximum Clique Problem (MCP) is a classical NP-hard problem that has gained considerable attention due to its numerous real-world applications and theoretical complexity. It is inherently computationally complex, and so...
Published by: IGI Global